National Repository of Grey Literature 61 records found  1 - 10nextend  jump to record: Search took 0.00 seconds. 
New Cellular Automata Design Techniques
Baláž, Martin ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
The aim of this master thesis is to introduce a new technique for the design of cellular automata which will provide a better possibilities for the implementation and solving given problems in an environment of non-uniform automata. In this work, the theoretical foundations of cellular automata have been summarized and the possibilities of their design were examined using two evolutionary principles that have commonly been used - genetic algorithm and cellular programming. Two principally different issues were selected on which the possibilities and capabilities of these techniques were proven: the synchronization problem and the system of implementation of logic gates in an environment of cellular automata. Based on a review of the implementation properties and the initial results of usage of these methods a new design method for cellular automata was created - cellular evolution. The cellular evolution with its method of "prediction of the future state of surrounding cells" provides new possibilities in the design of cellular automata since it operates with structured genes which allow the gene to be active for a variety of cellular surroundings. In the conclusion of this work, all three methods were compared on two selected problems and their abilities were summarized in a detailed overview.
Emergent Behavior of Cellular Automata
Říha, Michal ; Jaroš, Jiří (referee) ; Bidlo, Michal (advisor)
This work deals with the simulation of an emergent behavior in cellular automata. In particular, density task, synchronization task and chessboard generation problem are investigated. It uses evolutionary algorithm to solve this problem.
Structural Design Using Cellular Automata
Bezák, Jakub ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The aim of this paper is to introduce the readers to the field of cellular automata, their design and their usage for structural design. Genetic algorithms are usually involved in designing complicated cellular automata, and because of that they are also briefly described here. For the purposes of this work sorting networks are considered as suitable structures to be designed using cellular automata, however, they are not a part of the automata but they are generated separately by modified rules of a local transition function.
Development of Operating System Based on Evolutionary and Genetic Algorithms
Skorkovský, Petr ; Moučka,, Jiří (referee) ; Kovár, Martin (referee) ; Chvalina, Jan (advisor)
The main goal of the work is to introduce new ideas how traditional approaches for designing an operation system and associated software can be improved to be a part of automatic software evolution. It is generally supposed that algorithms found by the genetic programming processes cannot be used for exact calculations but only for approximate solutions. Several examples of software evolution are introduced, to show that quite precise solutions can be achieved. To reach this goal, characteristics of tree-like structures with approaches based on cellular automata features are combined in a new promising technique of algorithm representation, joining benefits of both concepts. An application has been developed based on these new genetic programming concepts and it is supposed it can be a part of a future automatic software evolution process.
Procedural Generation of Dungeon Type Structures
Šipoš, Marek ; Rychlý, Marek (referee) ; Bartík, Vladimír (advisor)
The main aim of this bachelor thesis was to design and develop a library for procedural generation of dungeons and web application for its practical use. The library offers a configuration interface, output generation according to this configuration and file support. The web application allows the visualization of the obtained input. The implementation was done in Java language.
Discrete Simulation of Programmable Systems
Mynář, Pavel ; Zuzaňák, Jiří (referee) ; Mlích, Jozef (advisor)
The subject of this thesis is the design and implementation of software library for discrete simulation of programmable units and their mutual communication and implementation of several illustrative examples based on it. The library is designed to be platform independent and as robust and simple to use as possible.
Mobile robot path planning by means of cellular automata
Gofroj, Patrik ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis describes certain ways of mobile robot path planning. The main concern of this thesis are cellular automata and their usage in this problem of searching of optimal path.
Editor and Simulator of Traffic by Cellular Automata
Vašátko, Libor ; Zbořil, František (referee) ; Žák, Jakub (advisor)
This thesis deals with cellular automata, mainly with their application in traffic simulation. Existing simulation models Nagel-Schreckenberg and Brake-light are analyzed, and their extension to simulate intersections is designed. Application for editing and simulating of any intersection is designed and implemented. This application allows to compare different simulation models also allows to add new simulation model created by user. In the end, designed extension for simulation models is tested.
Calibration of the high-speed traffic microsimulation
Korček, Pavol ; Apeltauer, Tomáš (referee) ; Pospíchal, Jiří (referee) ; Sekanina, Lukáš (advisor)
Tato disertační práce je zaměřena na vysokorychlostní simulace dopravy a jejich přesnou kalibraci pomocí různých typů dopravních dat. Práce se po úvodním popisu motivace pro samotný výzkum nejdříve věnuje současnému stavu poznání, a dále rozdělení simulátorů dopravy, zejména podle typu dat, se kterými se v nich pracuje. Úpravou existujícího řešení je navržen vlastní mikrosimulační model, který je založen na principu celulárního automatu. S tímto novým modelem je pak experimentováno, zpočátku z pohledu rychlosti simulace a další rozšiřitelnosti. Je navržena a popsána technika, kterou je možné navržený model významně akcelerovat a následně provádět simulace rychleji než v reálném čase i pro rozsáhlá území. Práce dále přistupuje k samotné kalibraci modelu, ke které byl využit evoluční přístup. Je představena metoda pro efektivní způsob optimalizace parametrů mikrosimulačního modelu, která nevyžaduje citlivostní analýzu a je schopná nalézt jinak obtížně nastavitelné parametry modelu. Kvalita získaných optimalizovaných modelů byla analyzována jak pomocí makroskopických, tak i mikroskopických dopravních dat, a to i s ohledem na jejich reálné vlastnosti, tj. chybějící vzorky. Dále jsou zhodnoceny výkonnostní a jiné kvalitativní parametry vlastního přístupu v porovnání s existujícími řešeními, přičemž bylo dosaženo významného zlepšení. Nakonec jsou představeny nástroje, které v rámci řešení vznikly. Na závěr je uvedeno další zaměření výzkumu, a to zejména s ohledem na využití výsledků práce v praxi.
Rendering Clouds in Real Time
Dostál, Radek ; Španěl, Michal (referee) ; Herout, Adam (advisor)
This thesis is about algorithms which render clouds in real time. The theoretical section deals with clouds in real world and also describes some algorithms for modeling and rendering them. The aim of practical section is implement one of these real time algorithms and develop demonstrational application.

National Repository of Grey Literature : 61 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.